An L2-identity and pinned distance problem
نویسندگان
چکیده
منابع مشابه
Spherical Means and Pinned Distance Sets
We use mixed norm estimates for the spherical averaging operator to obtain some results concerning pinned distance sets.
متن کاملAn Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملAn L2 Disturbance Attenuation Solution to the Nonlinear Benchmark Problem
In this paper, we use the theory of L2 disturbance attenuation for linear (H1) and nonlinear systems to obtain solutions to the Nonlinear Benchmark Problem (NLBP) proposed in the paper by Bupp et. al.1. By considering a series expansion solution to the Hamilton-Jacobi-Isaacs Equation associated with the nonlinear disturbance attenuation problem, we obtain a series expansion solution for a nonli...
متن کاملAn L2 Disturbance Attenuation Approach to the Nonlinear Benchmark Problem
to the Nonlinear Benchmark Problem Panagiotis Tsiotras Dept. of Mechanical, Aerospace and Nuclear Engineering University of Virginia Charlottesville, VA 22903-2442 Martin Corless and Mario A. Rotea School of Aeronautics and Astronautics Purdue University West Lafayette, IN 47907-1282 Abstract In this paper, we use the theory of L2 disturbance attenuation for linear (H1) and nonlinear systems to...
متن کاملAn improved algorithm for the L2 - Lp minimization problem
In this paper we consider a class of non-Lipschitz and non-convex minimization problems which generalize the L2 − Lp minimization problem. We propose an iterative algorithm that decides the next iteration based on the local convexity/concavity/sparsity of its current position. We show that our algorithm finds an -KKT point within O(log −1) iterations. The same result is also applied to the prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometric and Functional Analysis
سال: 2019
ISSN: 1016-443X,1420-8970
DOI: 10.1007/s00039-019-00482-8